Locating Binding Constraints in LP Problems

LP problems constrained with D-FRIs

In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated where the feasible region is formed as the intersection of two inequality fuzzy systems and Dombi family of t-norms is considered as fuzzy composition. Dombi family of t-norms includes a parametric family of continuous strict t-norms, whose members are increasing functions of ...

COMPILING CONSTRAINTS IN lp ( FD )

Duality for vector equilibrium problems with constraints

‎In the paper‎, ‎we study duality for vector equilibrium problems using a concept of generalized convexity in dealing with the quasi-relative interior‎. ‎Then‎, ‎their applications to optimality conditions for quasi-relative efficient solutions are obtained‎. ‎Our results are extensions of several existing ones in the literature when the ordering cones in both the objective space and the constr...

Locating phase transitions in computationally hard problems

We discuss how phase-transitions may be detected in computationally hard problems in the context of Anytime Algorithms. Treating the computational time, value and utility functions involved in the search results in analogy with quantities in statistical physics, we indicate how the onset of a computationally hard regime can be detected and the transit to higher quality solutions be quantified b...

Locating Overlapping Flexible Shapes Using Geometrical Constraints

In an earlier paper [1] we have proposed a shape representation called the CLD (Chord Length Distribution) which possesses many of the often-quoted desirable properties of a shape representation. It also captures shape variability and complements an object location method using belief updating which integrates low-level evidence and shape constraints. Promising results on synthetic and real rig...